#include <bits/stdc++.h>
using namespace std;
bool check(long long int x)
{
long long int cnt=0;
for(long long int p=2;p*p<=x;p++)
{
if(x%p==0)
{
while(x%p==0)x/=p;
if(x>1)return 0;
}
}
return 1;
}
int main()
{
vector<long long int> v;
long long int n;
cin>>n;
for(int i=2;i<=n;i++)
{
if(check(i))v.push_back(i);
}
cout<<v.size()<<endl;
for(auto t:v)
{
cout<<t<<" ";
}
return 0;
}
1025D - Recovering BST | 439A - Devu the Singer and Churu the Joker |
1323A - Even Subset Sum Problem | 1095A - Repeating Cipher |
630F - Selection of Personnel | 630K - Indivisibility |
20B - Equation | 600B - Queries about less or equal elements |
1015A - Points in Segments | 1593B - Make it Divisible by 25 |
680C - Bear and Prime 100 | 1300A - Non-zero |
1475E - Advertising Agency | 1345B - Card Constructions |
1077B - Disturbed People | 653A - Bear and Three Balls |
794A - Bank Robbery | 157A - Game Outcome |
3B - Lorry | 1392A - Omkar and Password |
489A - SwapSort | 932A - Palindromic Supersequence |
433A - Kitahara Haruki's Gift | 672A - Summer Camp |
1277A - Happy Birthday Polycarp | 577A - Multiplication Table |
817C - Really Big Numbers | 1355A - Sequence with Digits |
977B - Two-gram | 993A - Two Squares |